#include <iostream>
#include <cstdio>
#define MAXK 105
#define MAXN 1005
using namespace std;
typedef __int128_t ll;
ll dp[MAXK][MAXN];
int N, K;
void solve();
int main() {
    cin >> N >> K;
    solve();
}

void print(ll x) {
    if (!x) return;
    char a = x % 10 + '0';
    print(x / 10);
    putchar(a);
}


void solve() {
    for (int i = 0; i <= K; i++) dp[i][0] = 1;
    for (int i = 1; i <= K; i++) {
        for (int j = 1; j <= N; j++) {
            dp[i][j] = dp[i - 1][j];
            if (j >= i) dp[i][j] += dp[i][j - i];
        }
    }
    print(dp[K][N]);
    cout << endl;
    
}